SAT Competition 2016: Recent Developments
نویسندگان
چکیده
We give an overview of SAT Competition 2016, the 2016 edition of the famous competition for Boolean satisfiability (SAT) solvers with over 20 years of history. A key aim is to point out “what’s hot” in SAT competitions in 2016, i.e., new developments in the competition series, including new competition tracks and new solver techniques implemented in some of the award-winning solvers.
منابع مشابه
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our framework of Abstract DPLL and Abstract DPLL modulo Theories, we explain our DPLL(T) approach to SMT. Experimental results and future projects are discussed within BarcelogicTools, a set of logic-based tools developed by our research group in Barcelona. At the 2005 SMT compe...
متن کاملCADICAL, LINGELING, PLINGELING, TREENGELING and YALSAT Entering the SAT Competition 2017
This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It ...
متن کاملPseudo-Boolean Heuristics for 0-1 Integer Linear Programming
Many Integer Linear Programming (ILP) problems contain significant subproblems exclusively composed of 0-1 (binary) variables. Much effort has gone in to special solvers for 0-1 ILP, as well as specialized versions of 0-1 ILP. The boolean satisfiability problem (SAT), is fundamental to many fields, including Artificial Intelligence, Formal Verification, and Computer Aided Design, and can be vie...
متن کاملSplatz, Lingeling, Plingeling, Treengeling, Yalsat Entering the Sat Competition 2016
This paper serves as solver description for our new SAT solver Splatz and further documents the versions of our other solvers submitted to the SAT Competition 2016, which are Lingeling, its two parallel variants Treengeling and Plingeling, and our local search solver YalSAT.
متن کاملSAT-based cryptanalysis of ACORN
The CAESAR competition aims to provide a portfolio of authenticated encryption algorithms. SAT solvers represent powerful tools to verify automatically and efficiently (among others) the confidentiality and the authenticity of information claimed by cryptographic primitives. In this work, we study the security of the CAESAR candidate Acorn against a SAT-based cryptanalysis. We provide the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017